全球稀土贸易网络的动态演变与影响机制————基于产业链的视角     

庄德林  李嘉豪  陈紫若  刘雨晨 《地理科学》2022,42(11):1900-1911

基于稀土产业链视角,通过依赖关系构建稀土初级加工品、中级加工品和制成品贸易网络,运用社会网络分析法和动态指数随机图模型对稀土贸易网络结构演变特征及其影响机制进行对比分析。结果表明：① 3个环节稀土贸易网络均呈现向复杂网络演变的趋势,且稀土中级加工品贸易网络的变化趋势依次领先于稀土制成品和初级加工品贸易网络;② 从主干结构看,3个环节稀土贸易网络依次由欧洲主导向欧美并立演变、由中国主导向欧亚并立演变、由欧美亚三足鼎立向亚洲主导演变;③ 中国在3个环节稀土贸易网络中均发展成为直接影响力前三甲国家（地区）,但其领先优势逐渐缩小,而间接影响力仅在初级加工品和制成品网络进入前三甲行列,且增幅较小;④ 互惠、三角形、星形辐射和星形扩张结构效应对3个环节稀土贸易网络动态演变具有显著的异质性影响。  相似文献   

2000—2020年印度土地利用的时空演化及驱动因素分析     

张红  邓雯  王艺 《世界地理研究》2022,31(4):786-799

印度已成为全球十大经济体之一,也是全球增长最快的新兴经济体。作为世界耕地大国和农业大国,印度的土地利用格局演化对全球粮食安全和可持续发展意义重大。收集了印度2000、2010和2020年3期土地利用数据,借助景观格局指数、土地利用动态度模型、土地利用转移图谱等方法刻画了印度土地利用的规模、组成、形态、格局及时空演化特征,研究发现：①印度的土地利用类型中,耕地占比最高,2020年占总面积的62.91%。斑块形态较复杂,其面积加权平均斑块分维数为1.37。耕地总面积保持相对稳定,与其他用地类型的转入转出整体保持平衡,但耕地转为建设用地的比率近年来快速增加,2010—2020年建设用地成为耕地主转出类型,反映了快速城市化与人口增长的影响。②林地为印度第二大用地类型,空间集聚特征明显。林地面积持续而缓慢地减少,2000—2010年主要退化为未利用地（转出比率19.73%）,2010—2020年主要与草地相互转换（转入转出比率分别为17.94%、18.17%）。③印度草地分布破碎离散,因转入大于转出,总面积持续小幅度增加,2000—2010年、2010—2020年草地新增面积分别占所有用地新增面积的28.31%、28.64%,新增用地多由林地转入（分别为18.91%、18.17%）。④建设用地主要分布于首都新德里及印度东部的西孟加拉邦和阿萨姆邦,斑块相对规则。近年来,印度建设用地面积不断扩张,2010—2020动态度达2.51%,主要由耕地转入。⑤构建地理加权回归模型,发现极端温度、高程、人口、GDP与政策是印度耕地与建设用地演化的主要驱动因子。  相似文献   

海洋中深度与压强的转换方法     

冀天宇  蒋国荣  史剑  周中刚  邓波 《海洋预报》2015,32(2):45-50

介绍了海洋学计算中3种深度与压强的转化方法:(1)EOS-80(Equation of State of Seawater 1980,EOS-80)标准采用的方法;(2)最新发布的TEOS-10(Thermodynamics Equation of seawater 2010,TEOS-10)标准采用的方法;(3)通过海水吉布斯函数计算压强与深度的关系的方法。对以上3种计算方法进行了比较,结果表明:在一般的海洋学研究中,3种方法精度相差不大,均可使用。在要求计算效率的情况下,可以选用EOS-80标准采用的方法,在更高精度的海洋学研究中,应该使用TEOS-10标准采用的方法或者吉布斯函数方法。  相似文献   

引入松弛因子的高分辨率遥感影像自动多层次分割     

邓富亮  唐娉  刘源  杨崇俊 《遥感学报》2013,17(6):1492-1507

针对当前高分辨率遥感影像多层次分割尺度参数设置缺少理论框架支持、人为因素影响较多等缺点,提出一种引入松弛因子的高分辨率遥感影像自动多层次分割方法。该方法利用1个松弛因子调节引导区域对象合并的异质性值大小,通过控制每次递归合并区域的对象个数,提高了整体分割的速度;以区域对象间异质性平均值作为基数,引入另一个松弛因子控制分割过程中层次输出的尺度参数,使整个分割过程自动得到不同尺度的多层次分割结果。实验结果表明,该方法具有较高的分割质量,能够满足遥感影像分析及地物提取的精度要求,并且减少了人为因素影响,提高了自动化程度。但是,对于复杂图像内容的地物目标边界处理和减少狭长区域对象的出现还需要进一步深入研究和实践。  相似文献   

Applications of graph theory to gross error detection for GPS geodetic control networks     

Samwel Katambi  Guo Jiming  Kong Xiangyuan 《地球空间信息科学学报》2013,16(4):26-31

This paper describes a broad perspective of the application of graph theory to establishment of GPS control networks whereby the GPS network is considered as a connected and directed graph with three components. In this algorithm the gross error detection is undertaken through loops of different spanning trees using the “Loop Law” in which the individual components ΔX, ΔY and ΔZ sum up to zero. If the sum of the respective vector components ΩX, ΩY and ΩZ in a loop is not zero and if the error is beyond the tolerable limit (ε>ω), it indicates the existence of gross errors in one of the baselines in the loop and therefore the baseline must be removed or re-observed. After successful screening of errors by graph theory, network adjustment can be carried out. In this paper, the GPS data from the control network established as refence system for the HP Dam at Baishan county in Liaoning province is presented to illustrate the algorithm.  相似文献   

A fewest-turn-and-shortest path algorithm based on breadth-first search     

Yan Zhou  Weisheng Wang  Di He  Zhe Wang 《地球空间信息科学学报》2013,16(4):201-207

Many cognitive studies have indicated that the path simplicity may be as important as its distance travelled. However, the optimality of paths for current navigation system is often judged purely on the distance travelled or time cost, and not the path simplicity. To balance these factors, this paper presented an algorithm to compute a path that not only possesses fewest turns but also is as short as possible by utilizing the breadth-first-search strategy. The proposed algorithm started searching from a starting point, and expanded layer by layer through searching zero-level reachable points until the endpoint is found, and then deleted unnecessary points in the reverse direction. The forward searching and backward cleaning strategies were presented to build a hierarchical graph of zero-level reachable points, and form a fewest-turn-path graph (G*). After that, a classic Dijkstra shortest path algorithm was executed on the G* to obtain a fewest-turn-and-shortest path. Comparing with the shortest path in Baidu map, the algorithm in this work has less than half of the turns but the nearly same length. The proposed fewest-turn-and-shortest path algorithm is proved to be more suitable for human beings according to human cognition research.  相似文献   

Applicability of the Modified Universal Soil Loss Equation for prediction of sediment yield in Khanmirza watershed,Iran     

《水文科学杂志》2013,58(5):1068-1075

Abstract

The present study aims to estimate the sediment yield due to storm rainfall and runoff at the outlet of the Khanmirza watershed (395 km²) located in western Iran. The estimation was made for six storm events using the Modified Universal Soil Loss Equation (MUSLE). All the inputs required for the application of the model were determined through runoff and sediment concentration monitoring at the time of storm events, and field surveys in the study area. The applicability of the model to the study area was then evaluated by comparison of its estimates with those calculated using the measured sediment data. The results of the study demonstrated the efficiency of the MUSLE in estimating storm-associated sediment yield except one storm event in the study area with a high level of agreement and non-significant differences between mean estimated and measured values in the study storm events.  相似文献   

A Franco-American Geographical Encounter     

《The Professional geographer》2013,65(3):367-368

ATLAS?GRAPHICS (Version 3.0).

AutoCAD (Release 9.0 with ADE+1, ADE+2 and ADE+3).

AutoSketch (Speed Enhanced Version 1.02).

NUMERICAL RECIPES FORTRAN. Numerical Recipes Software

SCIPLOT.  相似文献   

A graph-based algorithm to define urban topology from unstructured geospatial data     

J.-P. de Almeida  J.G. Morley  I.J. Dowman 《International journal of geographical information science》2013,27(8):1514-1529

Interpretation and analysis of urban topology are particularly challenging tasks given the complex spatial pattern of the urban elements, and hence their automation is especially needed. In terms of the urban scene meaning, the starting point in this study is unstructured geospatial data, i.e. no prior knowledge of the geospatial entities is assumed. Translating these data into more meaningful homogeneous regions can be achieved by detecting geographic features within the initial random collection of geospatial objects, and then by grouping them according to their spatial arrangement. The techniques applied to achieve this are those of graph theory applied to urban topology analysis within GIS environment. This article focuses primarily on the implementation and algorithmic design of a methodology to define and make urban topology explicit. Conceptually, such procedure analyses and interprets geospatial object arrangements in terms of the extension of the standard notion of the topological relation of adjacency to that of containment: the so-called ‘containment-first search’. LiDAR data were used as an example scenario for development and test purposes.  相似文献   

如何运用GeoMAG软件使图件结构规范化——以贵州省分幅实际材料图为例     

邬晓芳  邓毅  王常薇  况忠 《贵州地质》2012,29(2):156-159

根据《全国矿产资源潜力评价数据模型规范》要求,图件结构模型包括图件名称、图件代码、图件分层、图件比例尺、坐标系参数、图层对应属性数据表、属性数据项代码等,全国矿产资源潜力评价项目办开发了GeoMAG软件来帮助大家更快、更好的规范图件。笔者在工作过程中视不同情况分别采用生成图件结构和规范图件结构两种方法对图件进行规范化处理,使提交的图件符合《全国矿产资源潜力评价数据模型规范》要求。  相似文献